Dynamic Multiple Depots Vehicle Routing in the Physical Internet context

This paper proposes Dynamic Multiple Depots Vehicle Routing (DMDVR) to explore the feasible solution of routing transportation between PI-hubs and retailers in same cluster. The this research is constructed by daily forecasting demand a commodity crop, Pineapple, from Thailand’s northern region. Each route composed starting hub, number retailers, an ending hub. authors propose Mixed Integer Linear Programming (MILP) construct routes considering inventory truck capacity constraints. Besides, another method proposed using heuristic named “Iterated Random Heuristic”. empirical results are evaluated total distribution cost computational time. based on delivery retailers. show that Iterated Heuristic with Nearest Neighbor Search generates near-optimal solutions within short